多对一双方匹配市场中的最优化

在双方市场中定义的博弈概念，可以使市场同方参与者的收益同时达到最大．这种最优化存在的理论依据是选择匹配的稳定性．用博弈论的分析与证明方法研宄多对一双方匹配市场中的最优化．在替代偏好和LAD（Law of Aggregate Demend）偏好下，证明由企业作选择的选择函数一定是个稳定匹配，由工人做选择的选择函数也是一个稳定匹配．     

Difluorocarbene-Induced Ring-Opening Difluoromethylation-Halogenation of Cyclic (Thio)Ethers with TMSCF2X (X=Br,Cl)**

The ring-opening difluoromethylation-halogenation of cyclic (thio)ethers is reported through a simple strategy relying on carbon-chalcogen bond activation with difluorocarbene. The reaction proceeds through in situ protonation of the previously little-known difluoromethylene oxonium or sulfonium ylide intermediate followed by ring-opening with halide ion to afford halogenated acyclic difluoromethyl (thio)ethers that can then be employed for further elaboration. TMSCF₂X (X=Br, Cl) are unique reagents to achieve this synthetic purpose, which serve as both the difluorocarbene source and the halide ion source.     

Erdős matching conjecture for almost perfect matchings

In 1965 Erd?s asked, what is the largest size of a family of k-element subsets of an n-element set that does not contain a matching of size $s+1$? In this note, we improve upon a recent result of Frankl and resolve this problem for $s>101k^3$ and $(s+1)k?n<(s+1)(k+\frac{1}{100k})$.     

运用CAFP教学提升学生化学意志素质的教学案例

鉴于当前学生化学意志素质缺乏的问题，探讨以认知、情绪唤醒、情感、意志为主控目标，在预习、尝试学习、交错搭配合作学习中，开展CAFP教学研究，以促成情意因素对认知的调动、动力、强化等功能。     

用于考察外源添加剂对卷烟常规烟气指标影响的样品制备因子筛选

为筛选用于考察外源添加剂对卷烟常规烟气指标影响的样品制备关键控制因子,采用L_8(2~7)正交试验设计进行香兰素及乙基麦芽酚的添加实验.卷烟常规烟气指标变化数值通过极差分析、方差分析,结果显示:参比卷烟种类是影响卷烟烟气总粒相物、焦油、水分的高度显著因子,就试验采用的1R5F和3R4F参比卷烟而言,添加剂在高焦油3R4F卷烟中对常规烟气指标的影响比其在低焦油1R5F卷烟中的影响大;添加剂种类与浓度的交互作用不仅对卷烟烟气总粒相物有高度显著影响,而且对总粒相物中的水分也有显著影响;因此,规范样品制备,可减少误差、保证后续外源添加剂加入对卷烟常规烟气指标影响评价结果和推断的可靠性及科学性.     

Simultaneous determination of boscalid and fludioxonil in grape and soil under field conditions by gas chromatography/tandem triple quadrupole mass spectrometry

A gas chromatography–tandem mass spectrometry method was developed and validated to simultaneously determine boscalid and fludioxonil in grape and soil samples. These samples were extracted with 10 mL of acetonitrile and purified using a mixed primary secondary amine/octadecylsilane sorbent. The method showed good linearity (R² > 0.99) in the calibration range 0.005–2 μg/mL for both pesticides. The limits of detection and quantification for the two analytes in grape and soil were 0.006 and 0.02 mg/kg, respectively. Fungicide recoveries in grape and soil were 81.18–92.11% for boscalid and 82.73–97.67% for fludioxonil with relative standard deviations of 1.31–10.31%. The established method was successfully applied to the residual analysis of boscalid and fludioxonil in real grape and soil samples. The terminal residue concentrations of boscalid and fludioxonil in grape samples collected from Anhui and Guizhou were <5 mg/kg (the maximum residue limit set by China) 7 days after the last application and 1 mg/kg (the maximum residue limit set by USA) 14 days after the last application. These results could provide guidance for the proper and safe use of boscalid and fludioxonil in grape and help the Chinese government to establish an MRL for fludioxonil in grape.     

Generalized matching theorems for closed coverings of convex sets

In this paper we use fixed point and coincidence theorems due to Park [8] to give matching theorems concerning closed coverings of nonempty convex sets in a real topological vector space. Our new results extend previously given ones due to Ky Fan [2], [3], Shih [10], Shih and Tan [11], and Park [7].     

Gray codes extending quadratic matchings

Is it true that every matching in the n-dimensional hypercube can be extended to a Gray code? More than two decades have passed since Ruskey and Savage asked this question and the problem still remains open. A solution is known only in some special cases, including perfect matchings or matchings of linear size. This article shows that the answer to the Ruskey–Savage problem is affirmative for every matching of size at most . The proof is based on an inductive construction that extends balanced matchings in the completion of the hypercube by edges of into a Hamilton cycle of . On the other hand, we show that for every there is a balanced matching in of size that cannot be extended in this way.     

The minimum forcing number of perfect matchings in the hypercube

Let $M$ be a perfect matching in a graph. A subset $S$ of $M$ is said to be a forcing set of $M$, if $M$ is the only perfect matching in the graph that contains $S$. The minimum size of a forcing set of $M$ is called the forcing number of $M$. Pachter and Kim (1998) conjectured that the forcing number of every perfect matching in the $n$-dimensional hypercube is $2^{n?2}$, for all $n\ge 2$. This was revised by Riddle (2002), who conjectured that it is at least $2^{n?2}$, and proved it for all even $n$. We show that the revised conjecture holds for all $n\ge 2$. The proof is based on simple linear algebra.